An algorithm for finding a nearly minimal balanced set in Fp
نویسنده
چکیده
For a prime p, we call a non-empty subset S of the group Fp balanced if every element of S is the midterm of a three-term arithmetic progression, contained in S. A result of Browkin, Divǐs and Schinzel implies that the size of a balanced subset of Fp is at least log2 p+1. In this paper we present an efficient algorithm which yields a balanced set of size (1 + o(1)) log2 p as p grows.
منابع مشابه
Using a Data Mining Tool and FP-Growth Algorithm Application for Extraction of the Rules in two Different Dataset (TECHNICAL NOTE)
In this paper, we want to improve association rules in order to be used in recommenders. Recommender systems present a method to create the personalized offers. One of the most important types of recommender systems is the collaborative filtering that deals with data mining in user information and offering them the appropriate item. Among the data mining methods, finding frequent item sets and ...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملAn Explicit Viscosity Iterative Algorithm for Finding Fixed Points of Two Noncommutative Nonexpansive Mappings
We suggest an explicit viscosity iterative algorithm for finding a common element in the set of solutions of the general equilibrium problem system (GEPS) and the set of all common fixed points of two noncommuting nonexpansive self mappings in the real Hilbert space.
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملEvaluation of Rough Set Theory for Decision Making of rehabilitation Method for Concrete Pavement
In recent years a great number of advanced theoretical - empirical methods has been developed for design & modeling concrete pavements distress. But there is no reliable theoretical method to be use in evaluation of conerete pavements distresses and making a decision about repairing them. Only empirical methods is used for this reason. One of the most usual methods in evaluating concrete paveme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 78 شماره
صفحات -
تاریخ انتشار 2009